Asymmetric polygons with maximum area
نویسندگان
چکیده
We say that a polygon inscribed in the circle is asymmetric if it contains no two antipodal points being the endpoints of a diameter. Given n diameters of a circle and a positive integer k < n, this paper addresses the problem of computing a maximum area asymmetric k-gon having as vertices k < n endpoints of the given diameters. The study of this type of polygons is motivated by ethnomusiciological applications.
منابع مشابه
Finding the Maximum Area Axis-parallel Rectangle in a Polygon
We consider the geometric optimization problem of nding the maximum area axis-parallel rectangle (MAAPR) in an n-vertex general polygon. We characterize the MAAPR for general polygons by considering di erent cases based on the types of contacts between the rectangle and the polygon. We present a general framework for solving a key subcase of the MAAPR problem which dominates the running time fo...
متن کاملShortest Paths Help Solve Geometric Optimization Problems in Planar Regions
The goal of this paper is to show that the concept of the shortest path inside a polygonal region contributes to the design of eecient algorithms for certain geometric optimization problems involving simple polygons: computing optimum separators, maximum area or perimeter inscribed triangles, a minimum area circumscribed concave quadrilateral, or a maximum area contained triangle. The structure...
متن کاملFinding Minimum Area k-gons
Given a set P of n points in the plane and a number k, we want to find a polygon ~ with vertices in P of minimum area that satisfies one of the following properties: (1) cK is a convex k-gon, (2) ~ is an empty convex k-gon, or (3) ~ is the convex hull of exactly k points of P. We give algorithms for solving each of these three problems in time O(kn3). The space complexity is O(n) for k = 4 and ...
متن کاملOptimal space coverage with white convex polygons
Assume that we are given a set of points some of which are black and the rest are white. The goal is to find a set of convex polygons with maximum total area that cover all white points and exclude all black points. We study the problem on three different settings (based on overlapping between different convex polygons): (1) In case convex polygons are permitted to have common area, we present ...
متن کاملMinkowski decomposition of convex polygons into their symmetric and asymmetric parts
This paper discusses Minkowski decomposition of convex polygons into their symmetric and totally asymmetric parts. Two diierent types of symmetries are considered: nite order rotations and line reeections. The approach is based on the representation of convex polygons through their perimetric measure. (NWO) through a visitor's grant. He is grateful to the Centrum voor Wiskunde en Informatica (C...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- European Journal of Operational Research
دوره 248 شماره
صفحات -
تاریخ انتشار 2016